Dependency Parsing with an Extended Finite-State Approach

Dependency Parsing with an Extended Finite State Approach

This article presents a dependency parsing scheme using an extended finite-state approach. The parser augments input representation with “channels” so that links representing syntactic dependency relations among words can be accommodated and iterates on the input a number of times to arrive at a fixed point. Intermediate configurations violating various constraints of projective dependency repr...

Parsing in two frameworks: finite-state and functional dependency grammar

An improved joint model: POS tagging and dependency parsing

Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...

Incremental Finite-State Parsing

This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at the sentence level in an incremental way, depending on the contex-tual information available at a given stage. This approach overcomes the inefficiency of previous fully reductionist constraint-based systems, while mai...

Context-Free Parsing With Finite-State Transducers

Analyse syntaxique du frann cais. Grammaire en cha^ ne. Number 2 in Etudes en linguistique frann caise et g en erale. Benjamins, Am-sterdam, 1979. Tom86] Masaru Tomita. EEcient Parsing for Natural Language. A fast algorithm for practical systems. Kluwer, Boston/Dordrecht/Lancaster, 1986. 201 p.